ANNALS OF PURE AND APPLIED LOGIC In conjunction with qualitative probability
نویسنده
چکیده
Numerical probabilities (associated with propositions) are eliminated in favor of qualitative notions, with an eye to isolating what it is about probabilities that is essential to judgements of acceptability. A basic choice point is whether the conjunction of two propositions, each (separately) acceptable, must be deemed acceptable. Concepts of acceptability closed under conjunction are analyzed within Keisler’s weak logic for generalized quantifiers or more specifically, filter quantifiers. In a different direction, the notion of a filter is generalized so as to allow sets with probability non-infinitesimally below 1 to be acceptable.
منابع مشابه
Curriculum Vitae Education Teaching Interests Employment
Eventualities and worlds are analyzed uniformly as schedules of certain descriptions of eventuality-types (reversing the reduction of eventuality-types to eventualities). The temporal interpretation of modals in Condoravdi 2002 is reformulated to bring out what it is about eventualities and worlds that is essential to the account. What is essential, it is claimed, can be recovered from schedule...
متن کاملPartial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the substitution rule has to be modi ed. It is developed here in its minimal form, with equality and conjunction, as partial Horn logic . Various kinds of logical theory are equivalent: partial Horn theories, quasi-equational ...
متن کاملOn the Provability Logic of Bounded Arithmetic
Berarducci, A. and R. Verbrugge, On the provability logic of bounded arithmetic, Annals of Pure and Applied Logic 61 (1993) 75-93. Let PLQ be the provability logic of IA, + G?,. We prove some containments of the form L c_ PLQc Th(V) where L is the provability logic of PA and V is a suitable class of Kripke frames.
متن کاملWeakly Semirecursive Sets and r.e. Orderings
Kummer, M. and F. Stephan, Weakly semirecursive sets and r.e. orderings, Annals of Pure and Applied Logic 60 (1993) 133-150. Weakly semirecursive sets have been introduced by Jockusch and Owings (1990). In the present paper their investigation is pushed forward by utilizing r.e. partial orderings, which turn out to be instrumental for the study of degrees of subclasses of weakly semirecursive s...
متن کاملThe Logic of Arithmetical Hierarchy
Dzhaparidze, G., The logic of arithmetical hierarchy, Annals of Pure and Applied Logic 66 (1994) 89-112. Formulas of the propositional modal language with the unary modal operators 0, H,, B,, Zz, I!!,, are considered as schemata of sentences of arithmetic (PA), where q A is interpreted as (a formalization of) “A is PA-provable”, X,,A as “A is PA-equivalent to a &-sentence” and &,A as “A is PA-e...
متن کامل